package a10_动态规划;

/**
 * <p>
 * a04_使用最小花费爬楼梯复习2
 * </p>
 *
 * @author flyduck
 * @since 2025/2/17
 */
public class a04_使用最小花费爬楼梯复习2 {

    public static void main(String[] args) {
        System.out.println(minCostClimbingStairs(new int[]{10, 15, 20}));
    }

    //[10,15,20]
    //dp[i]:爬到第i个台阶需要的最小花费
    //递推公式：dp[i] = Math.min(dp[i-1] + cost[i-1],dp[i-2] + cost[i-2])
    //从i-1爬到i：dp[i-1] + cost[i-1]
    //从i-2爬到i：dp[i-2] + cost[i-2]
    //初始化：dp[0] = 0  dp[1] = 0
    public static int minCostClimbingStairs(int[] cost) {
        int[] dp = new int[cost.length + 1];
        dp[0] = 0;
        dp[1] = 0;
        for (int i = 2; i <= cost.length; i++) {
            dp[i] = Math.min(dp[i-1] + cost[i-1],dp[i-2] + cost[i-2]);
        }

        return dp[dp.length-1];
    }

}
